Survey of Algorithms on Maximum Clique Problem
نویسندگان
چکیده
منابع مشابه
The maximum clique problem
In this paper we present a survey of results concerning algorithms, complexity, and applications of the maximum clique problem. We discuss enumerative and exact algorithms, heuristics, and a variety of other proposed methods. An up to date bibliography on the maximum clique and related problems is also provided.
متن کاملThe Maximum Clique Problem
Description Given an undirected graph G = ( V, E ), a clique S is a subset of V such that for any two elements u, v ∈ S, ( u, v ) ∈ E. Using the notation ES to represent the subset of edges which have both endpoints in clique S, the induced graph GS = ( S, ES ) is complete. Finding the largest clique in a graph is an NP-hard problem, called the maximum clique problem (MCP). Cliques are intimate...
متن کاملGenetic Algorithms Based Solution To Maximum Clique Problem
Maximum Clique Problem (MCP) is an NP Complete problem which finds its application in diverse fields. The work suggests the solution of above problem with the help of Genetic Algorithms (GAs). The work also takes into consideration, the various attempts that have been made to solve this problem and other such problems. The intend is to develop a generic methodology to solve all NP Complete prob...
متن کاملOn solving the maximum clique problem
Abstract. The Maximum Clique Problem (MCP) is regarded here as the maximization of an indefinite quadratic form over the canonical simplex. For solving MCP an algorithm based upon Global Optimality Conditions (GOC) is applied. Furthermore, each step of the algorithm is analytically investigated and tested. The computational results for the proposed algorithm are compared with other Global Searc...
متن کاملFast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, informatics, and many other areas. Although there exist several algorithms with acceptable runtimes for certain classes of graphs, many of them are infeasible for massive graphs. We present a new exact algorithm that employs novel pruning techniques to very quickly find maximum cliques...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IARJSET
سال: 2015
ISSN: 2393-8021
DOI: 10.17148/iarjset.2015.2203